Model-based Automatic Synthesis and Analysis in Second-Order Monadic Logic

نویسندگان

  • Tiziana Margaria
  • Michael Mendler
چکیده

This paper shows how monadic second-order logic on strings M2L(Str) can pro tably be used as a description language for model-based analysis of software as well as hardware systems. It is therefore a good candidate formalism for hardware/software codesign. This logic conveniently combines two important features in a single formalism: It is both an abstract speci cation language and an e ective programming language. As a predicate logic it admits high-level behavioral design capture in which we focus on what is to be achieved rather than how this is done. Yet, in contrast to full higher-order logic, this expressiveness is not compromised by a loss of e ectiveness. Every speci cation can be translated into an equivalent nite state automaton, and thus is decidable and executable. We illustrate these features along a case study.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Logic Programs and Monadic Second Order Logics by Program Transformation

We present a program synthesis method based on unfold/fold transformation rules which can be used for deriving terminating definite logic programs from formulas of the Weak Monadic Second Order theory of one successor (WS1S). This synthesis method can also be used as a proof method which is a decision procedure for closed formulas of WS1S. We apply our synthesis method for translating CLP(WS1S)...

متن کامل

Cardinality Quantifiers in MLO over Trees

We study an extension of monadic second-order logic of order with the uncountability quantifier “there exist uncountably many sets”. We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic second-order logic of order. Additionally we find that the continuum hypothesis holds for classes of sets definable in monadic second-order logic over ...

متن کامل

The Effectiveness of the Automatic System of Fuzzy Logic-Based Technical Patterns Recognition: Evidence from Tehran Stock Exchange

The present research proposes an automatic system based on moving average (MA) and fuzzy logic to recognize technical analysis patterns including head and shoulder patterns, triangle patterns and broadening patterns in the Tehran Stock Exchange. The automatic system was used on 38 indicators of Tehran Stock Exchange within the period 2014-2017 in order to evaluate the effectiveness of technical...

متن کامل

Automatic Structures and Their Complexity Bakhadyr Khoussainov and Mia Minnes

In recent years there has been increasing interest in the study of structures that can be presented by automata. The underlying idea in this line of research consists of applying properties of automata and techniques of automata theory to decision problems that arise in logic and applications. A typical example of a decision problem is the model checking problem, stated as follows. For a struct...

متن کامل

Disproving False Conjectures

For automatic theorem provers it is as important to disprove false conjectures as it is to prove true ones, especially if it is not known ahead of time if a formula is derivable inside a particular inference system. Situations of this kind occur frequently in inductive theorem proving systems where failure is a common mode of operation. This paper describes an abstraction mechanism for first-or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997